Problem of points - PDFSEARCH.IO - Document Search Engine

Problem of points
Results: 205

#	Item
191	PROBLEM OF THE WEEK Solution of Problem No. 8 (Spring 2014 Series) Problem: Where do you place five points on the unit circle of the plane to maximize the edge length of the inscribed simple polygon with these points as Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2014-03-25 15:00:19 Trigonometry Circles Complex analysis Pi Sine Unit circle Polygon Sinc function Angle Geometry Mathematics Mathematical analysis
192	PROBLEM OF THE WEEK Solution of Problem No. 1 (Spring 2014 Series) Problem: A simple polygon in the plane has n edges numbered from 1 to n. Let v~i be the vector which is perpendicular to the ith edge and which points in Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2014-01-29 14:23:54 Vectors Abstract algebra Vector calculus Introductory physics Euclidean vector Vector Null vector Simple polygon Algebra Mathematics Linear algebra
193	References [1] M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Ann. of Math. (2), 160(2):781–793, [removed]L. V. Ahlfors. Complex Analysis. McGraw-Hill Book Co., New York, third edition, 1978. An introduction to Add to Reading List Source URL: www.math.brown.edu Language: English - Date: 2008-03-20 11:42:48 Elliptic curves Public-key cryptography Elliptic curve cryptography NTRU Elliptic Curve DSA Lattice problem Counting points on elliptic curves Hyperelliptic curve cryptography Elliptic curve Cryptography Post-quantum cryptography Finite fields
194	42nd International Mathematical Olympiad Washington, DC, United States of America July 8–9, 2001 Problems Each problem is worth seven points. Add to Reading List Source URL: olympiads.win.tue.nl Language: English - Date: 2001-08-10 08:42:05 Triangles Angle Trigonometry Altitude Triangle Law of sines Law of cosines Fermat point Word problem for groups Geometry Mathematics Triangle geometry
195	March 4, 2001 TOURNAMENT OF TOWNS Spring 2001, Level A, Junior (grades[removed]Your total score is based on the three problems for which you earn the most points; the scores for the individual parts of a single problem are Add to Reading List Source URL: www.math.toronto.edu Language: English - Date: 2004-02-14 06:39:11 Triangles Euclidean plane geometry Triangle Polygon Geometry Euclidean geometry Triangle geometry
196	i ON SETS OF DISTANCES OF n POINTS Add to Reading List Source URL: www.math-inst.hu Language: English - Date: 2004-05-07 15:50:46 Curves Pi Polygon N-sphere Happy Ending problem Convex polytope Geometry Euclidean plane geometry Circle
197	28 Closest-Point Problems ------------------------------------------------------------------Geometric problems involving points on the plane usually involve implicit or explicit treatment of distances between the points. For example, a very natural problem which arises in many applications is the nearest-neighbor Add to Reading List Source URL: www.mif.vu.lt Language: English - Date: 2004-12-14 08:41:13 Discrete geometry Diagrams Discrete mathematics Voronoi diagram Proximity problems Closest pair of points problem Delaunay triangulation K-d tree Merge sort Geometry Mathematics Computational geometry
198	Closest Pair Problem • Given n points in d-dimensions, find two whose mutual distance is smallest. Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2002-11-26 12:59:11
199	Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points Add to Reading List Source URL: www.cs.uu.nl Language: English - Date: 2007-09-06 05:52:46 Facility location Minimum bounding box Closest pair of points problem Circle Polygon Proximity problems Smallest circle problem Geometry Bounding sphere Minimum bounding box algorithms

UPDATE